发动机机油滤清器虑层强度分析及优化

针对机油滤清器工作工况下进出口压差、机油滤层强度及导流桩高度等问题, 通过试验测试与仿真相结合, 对滤清器初步设计进行了评估及优化, 以确保滤清器在工作工况下进出口压降及滤层强度能满足要求. 首先进行滤层性能试验, 得到滤层的惯性阻力系数和黏性阻力系数; 再通过滤层多孔介质CFD分析, 对滤清器进出口压降进行分析计算. 结果表明: 在-18℃、25℃和70℃的工况下, 进出口压降都小于10kPa, 满足相关要求. 针对滤层的最大主应力超过其抗拉强度的问题, 通过CAE仿真分析, 优化滤层与导流桩间隙, 将滤层最大主应力由110.1MPa降至36.99MPa, 小于其抗拉强度42.8MPa.     

Perturbative manifolds and the Noether generators of nth-order Poisson equations

A manifold that contains small perturbations will induce a perturbed partial differential equation. The partial differential equation that we select is the Poisson equation – in order to explore the interplay between the geometry of the manifold and the perturbations. Specifically, we show how the problem of symmetry determination, for higher-order perturbations, can be elegantly expressed via geometric conditions.     

一类非线性抛物型变分不等方程的全局吸引子及弱近似惯性流形

对由一类非线性抛物型变分不等方程所描述的无穷维动力系统，给出了存在全局吸引子及弱近似惯性流形的充分条件．     

Isotopic families of contact manifolds for elliptic PDE

A test for a function to be a solution of an elliptic PDE is given in terms of extensions, as solutions, from the boundaries inside the domains belonging to an isotopic family. It generalizes a result of Ehrenpreis for spheres moved along a straight line.

     

On a poisson reduction for Gel'fand-Zakharevich manifolds

We formulate and discuss a reduction theorem for Poisson pencils associated with a class of integrable systems, defined on bi-Hamiltonian manifolds, recently studied by Gel'fand and Zakharevich. The reduction procedure is suggested by the bi-Hamiltonian approach to the separation of variables problem.     

The pure state space of quantum mechanics as Hermitian symmetric space

The pure state space of Quantum Mechanics is investigated as Hermitian Symmetric Kähler manifold. The classical principles of quantum mechanics (Quantum Superposition Principle, Heisenberg Uncertainty Principle, Quantum Probability Principle) and Spectral Theory of observables are discussed in this non-linear geometrical context.     

Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.     

Laguerre approximation of stable manifolds with application to connecting orbits

We present an algorithm, based on approximation by Laguerre polynomials, for computing a point on the stable manifold of a stationary solution of an autonomous system. A superconvergence phenomenon means that the accuracy of our results is much higher than the usual spectral accuracy. Both the theory and the implementation of the method are considered. Finally, as an application of the algorithm, we describe a fully spectral approximation of homo- and heteroclinic orbits.

     

A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations

Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.